On propositional form.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

In this paper, a new approach for enumerating the set prime implicants (PI) of a Boolean formula in conjunctive normal form (CNF) is proposed. It is based on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually i...

متن کامل

On propositional definability

In standard propositional logic, logical definability is the ability to derive the truth value of some propositional symbols given a propositional formula and the truth values of some propositional symbols. Although appearing more or less informally in various AI settings, a computation-oriented investigation of the notion is still lacking, and this paper aims at filling the gap. After recallin...

متن کامل

On the Propositional Attitudes

An adequate account of the nature of the so called 'propositional attitudes' has long been sought by philosophers of mind, and most theories which have been proposed have suffered from certain logical or epistemological defects or have been limited in scope. The issues centering around the nature of beliefs, desires, and the other attitudes pertain to two principal areas of investigation: the e...

متن کامل

On meta complexity of propositional formulas and propositional proofs

A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.

متن کامل

On Propositional Knowledge Base Updates

It is well known that the minimal change principle was widely used in propositional knowledge base updates. However, recent research has shown that under some circumstances, the conventional minimal change methods were inappropriate for updating knowledge bases with disjunctive eeects. In this paper we propose a new method for the knowledge base update based on a persistence principle, which pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1980

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093882942